On the rank of random subsets of finite affine geometry

نویسنده

  • Wojciech Kordecki
چکیده

The aim of the paper is to give an effective formula for the calculation of the probability that a random subset of an affine geometry AG(r−1, q) has rank r. Tables for the probabilities are given for small ranks. The expected time to the first moment at which a random subset of an affine geometry achieves the rank r is derived.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triple factorization of non-abelian groups by two maximal subgroups

The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...

متن کامل

Design of a Novel Framework to Control Nonlinear Affine Systems Based on Fast Terminal Sliding-Mode Controller

In this paper, a novel approach for finite-time stabilization of uncertain affine systems is proposed. In the proposed approach, a fast terminal sliding mode (FTSM) controller is designed, based on the input-output feedback linearization of the nonlinear system with considering its internal dynamics. One of the main advantages of the proposed approach is that only the outputs and external state...

متن کامل

Designs and codes in affine geometry

Classical designs and their (projective) q-analogs can both be viewed as designs in matroids, using the matroid of all subsets of a set and the matroid of linearly independent subsets of a vector space, respectively. Another natural matroid is given by the point sets in general position of an affine space, leading to the concept of an affine design. Accordingly, a t-(n, k, λ) affine design of o...

متن کامل

Sharply 2-transitive sets of permutations and groups of affine projectivities

Using new results on sharply transitive subsets, we determine the groups of projectivities of finite affine planes, apart from (unknown) planes of order 23 or 24. The group of all projectivities of a geometry G is a measure for the complexity of G: this group tends to be rather large if G is far from being a classical geometry. See [PS81] for more information on the role of projectivities in ge...

متن کامل

On generalized Hadamard matrices of minimum rank

Generalized Hadamard matrices of order qn−1 (q a prime power, n ≥ 2) over GF (q) are related to symmetric nets in affine 2-(qn, qn−1, (qn−1 − 1)/(q − 1)) designs invariant under an elementary abelian group of order q acting semi-regularly on points and blocks. The rank of any such matrix over GF (q) is greater than or equal to n− 1. It is proved that a matrix of minimum q-rank is unique up to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discussiones Mathematicae Graph Theory

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2000